Long paths and Hamiltonicity in random graphs
نویسندگان
چکیده
We discuss several classical results about long paths and Hamilton cycles in random graphs and present accessible versions of their proofs, relying on the Depth First Search (DFS) algorithm and the notion of boosters.
منابع مشابه
On Eulerianity and Hamiltonicity in Annihilating-ideal Graphs
Let $R$ be a commutative ring with identity, and $ mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ mathrm{A}(R)^{*}=mathrm{A}(R)setminuslbrace 0rbrace $ and two distinct vertices $ I $ and $ J $ are adjacent if and only if $ IJ=0 $. In this paper, conditions under which $AG(R)$ is either E...
متن کاملClaw-free graphs - A survey
In this paper we summarize known results on claw-free graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden subgraphs e) Invariants f) Squares g) Regular graphs h) Other hamiltonicity related results and generalizations ...
متن کاملOn the independence number and Hamiltonicity of uniform random intersection graphs
In the uniform random intersection graphs model, denoted by G n,m,λ , to each vertex v we assign exactly λ randomly chosen labels of some label set M of m labels and we connect every pair of vertices that has at least one label in common. In this model, we estimate the independence number α(G n,m,λ), for the wide, interesting range m = n α , α < 1 and λ = O(m 1/4). We also prove the hamiltonici...
متن کاملThe Coupling Method for Inhomogeneous Random Intersection Graphs
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functio...
متن کاملRobust Hamiltonicity of random directed graphs
In his seminal paper from 1952 Dirac showed that the complete graph on n ≥ 3 vertices remains Hamiltonian even if we allow an adversary to remove bn/2c edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on n ≥ 3 vertices with minimum inand out-degree at least n/2 contains a directed Hamilton cycle. Both statements q...
متن کامل